Superconvergent Two-Grid Methods for Elliptic Eigenvalue Problems
نویسندگان
چکیده
منابع مشابه
Superconvergent Two-Grid Methods for Elliptic Eigenvalue Problems
Some numerical algorithms for elliptic eigenvalue problems are proposed, analyzed, and numerically tested. The methods combine advantages of the two-grid algorithm (Xu and Zhou in Math Comput 70(233):17–25, 2001), the two-space method (Racheva and Andreev in ComputMethods ApplMath 2:171–185, 2002), the shifted inverse powermethod (Hu and Cheng in Math Comput 80:1287–1301, 2011; Yang and Bi in S...
متن کاملTwo-Grid Methods for Maxwell Eigenvalue Problems
Two new two-grid algorithms are proposed for solving the Maxwell eigenvalue problem. The new methods are based on the two-grid methodology recently proposed by Xu and Zhou [Math. Comp., 70 (2001), pp. 17-25] and further developed by Hu and Cheng [Math. Comp., 80 (2011), pp. 1287-1301] for elliptic eigenvalue problems. The new two-grid schemes reduce the solution of the Maxwell eigenvalue proble...
متن کاملSuperconvergent discontinuous Galerkin methods for second-order elliptic problems
We identify discontinuous Galerkin methods for second-order elliptic problems in several space dimensions having superconvergence properties similar to those of the Raviart-Thomas and the Brezzi-Douglas-Marini mixed methods. These methods use polynomials of degree k ≥ 0 for both the potential as well as the flux. We show that the approximate flux converges in L2 with the optimal order of k + 1,...
متن کاملVariational Methods for Nonlinear Elliptic Eigenvalue Problems
In the present note, we give a simple general proof for the existence of solutions of the following two types of variational problems: PROBLEM A. To minimize fa F(x> u, • • • , Du)dx over a subspace VofW>*(tt). PROBLEM B. TO minimize ƒ« F(x, w, • • • , Du)dx for u in V with / a G(x, u, • • • , D^u)dx^c. The solution of the first problem yields a weak solution of a corresponding elliptic boundar...
متن کاملA new superconvergent collocation method for eigenvalue problems
Here we propose a new method based on projections for the approximate solution of eigenvalue problems. For an integral operator with a smooth kernel, using an interpolatory projection at Gauss points onto the space of (discontinuous) piecewise polynomials of degree ≤ r−1, we show that the proposed method exhibits an error of the order of 4r for eigenvalue approximation and of the order of 3r fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2016
ISSN: 0885-7474,1573-7691
DOI: 10.1007/s10915-016-0245-2